The Monge problem with vanishing gradient penalization: Vortices and asymptotic profile
نویسندگان
چکیده
منابع مشابه
The Monge problem with vanishing gradient penalization: Vortices and asymptotic profile
We investigate the approximation of the Monge problem (minimizing ∫ Ω |T (x)− x|dμ(x) among the vector-valued maps T with prescribed image measure T#μ) by adding a vanishing Dirichlet energy, namely ε ∫ Ω |DT |. We study the Γ-convergence as ε → 0, proving a density result for Sobolev (or Lipschitz) transport maps in the class of transport plans. In a certain two-dimensional framework that we a...
متن کاملA Gradient Descent Solution to the Monge-Kantorovich Problem
We present a new, simple, and elegant algorithm for computing the optimal mapping for the Monge-Kantorovich problem with quadratic cost. The method arises from a reformulation of the dual problem into an unconstrained minimization of a convex, continuous functional, for which the derivative can be explicitly found. The Monge-Kantorovich problem has applications in many fields; examples from ima...
متن کاملOvercoming the vanishing gradient problem in plain recurrent networks
Plain recurrent networks greatly suffer from the vanishing gradient problem while Gated Neural Networks (GNNs) such as Long-short Term Memory (LSTM) and Gated Recurrent Unit (GRU) deliver promising results in many sequence learning tasks through sophisticated network designs. This paper shows how we can address this problem in a plain recurrent network by analyzing the gating mechanisms in GNNs...
متن کاملThe Vanishing Gradient Problem During Learning Recurrent Neural Nets and Problem Solutions
Received () Revised () Recurrent nets are in principle capable to store past inputs to produce the currently desired output. Because of this property recurrent nets are used in time series prediction and process control. Practical applications involve temporal dependencies spanning many time steps, e.g. between relevant inputs and desired outputs. In this case, however, gradient based learning ...
متن کاملA Transport Problem with Queue Penalization Effect
Consider a distribution of citizens in an urban area in which some services (supermarkets, post offices. . . ) are present. Each citizen, in order to use a service, spends an amount of time which is due both to the travel time to the service and to the queue time waiting in the service. The choice of the service to be used is made by every citizen in order to be served more quickly. Two types o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Mathématiques Pures et Appliquées
سال: 2016
ISSN: 0021-7824
DOI: 10.1016/j.matpur.2016.02.009